Detecting Dataraces for BPEL-based Services using Weighted Vector Clock

BPEL is the most popular business process specification language, so it is crucial to ensure the quality and reliability of BPEL-based services. The dead-path elimination semantic determines that the datarace detection must adopt a new technique. Timestamps notation is an effective way to solve unexpected execution like determining the potential causality among events in concurrent programs, so in this paper we focus on the timestamps which can be used to analyze the data races among activities. The vector clock is used to judge whether BPEL activity pairs is concurrent or not. And the weighted value of event is used to improve the accuracy of the data races detection for BPEL process which consists of link semantic (transition condition and join condition) and path condition, the weighted value is calculated using abstract interpretation. Finally, experimental results show the efficiency of this approach.